Abstract: It is a hot issue to study how to locate the resource efficiently in P2P networks and grid computing. Chord is a structured P2P routing protocol based on DHT, with the features of fully distributed, load balancing and availability and so on. But it is of a poor performance because of redundant information in the finger table. In this paper, OHChord is proposed. It reduces redundancy and improves query stability by two methods. Firstly, an improved finger structure is presented for removing redundancy. Secondly, a hot routing table is added for each node. Comparing with the original Chord and partitionbased Chord, OHChord can improve the resource retrieving efficiently.

Key words: Chord routing algorithm, DHT, routing hot point, resource locating